Improving Query Answering over DL-Lite Ontologies
نویسندگان
چکیده
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies with very large instance sets (ABoxes). So far, in DL-Lite systems, this goal has been actually achieved only for relatively simple (short) conjunctive queries. In this paper we present Presto, a new query answering technique for DL-Lite ontologies, and an experimental comparison of Presto with the main previous approaches to query answering in DL-Lite. In practice, our experiments show that, in real ontologies, current techniques are only able to answer conjunctive queries of less than 7-10 atoms (depending on the complexity of the TBox), while Presto is actually able to handle conjunctive queries of up to 30 atoms. Furthermore, in the cases that are already successfully handled by previous approaches, Presto is significantly more efficient.
منابع مشابه
High Performance Query Answering over DL-Lite Ontologies
Current techniques for query answering over DL-Lite ontologies have severe limitations in practice, since they either produce complex queries that are inefficient during execution, or require expensive data pre-processing. In light of this, we present two complementary sets of results that aim at improving the overall peformance of query answering systems. We show how to create ABox repositorie...
متن کاملTowards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملParaconsistent query answering over DL-Lite ontologies
Consistent query answering over description logic-based ontologies is an important topic in ontology engineering as it can provide meaningful answers to queries posed over inconsistent ontologies. Current approaches for dealing with this problem usually consist of two steps: the first step is extracting some consistent sub-ontologies of an inconsistent ontology, then posing the query over these...
متن کاملQuery Rewriting for Horn-SHIQ Plus Rules
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite a given query to an equivalent SQL or Datalog query over a database associated with the ontology. This approach has been intensively studied for conjunctive query answering in the DL-Lite and EL families, but is much less explored fo...
متن کاملExpressive Querying over Fuzzy DL-Lite Ontologies
Fuzzy Description Logics (f-DLs) have been proposed as formalisms capable of capturing and reasoning about imprecise and vague knowledge. The last years, research in Description Logics, and also in fDLs, is largely focused on the development of languages where complexity of query answering is as efficient as query answering in data bases. One such example is the DL-Lite language and its fuzzy e...
متن کامل